$\text{M}^{3}$ -STEP: Matching-Based Multi-Radio Multi-Channel Spectrum Trading With Evolving Preferences
نویسندگان
چکیده
منابع مشابه
Interference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملinterference-aware and cluster based multicast routing in multi-radio multi-channel wireless mesh networks
multicast routing is one of the most important services in multi radio multi channel (mrmc) wireless mesh networks (wmn). multicast routing performance in wmns could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. in this paper we want to address the multicast routing problem for a given channel assignment in wmns. the channels...
متن کاملMulti-Step Scenario Matching Based on Unification
This paper presents an approach to multi-step scenario specification and matching, which aims to address some of the issues and problems inherent in to scenario specification and event correlation found in most previous work. Our approach builds upon the unification algorithm which we have adapted to provide a seamless, integrated mechanism and framework to handle event matching, filtering, and...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملStable Matching with Evolving Preferences
We consider the problem of stable matching with dynamic preference lists. At each time step, the preference list of some player may change by swapping random adjacent members. The goal of a central agency (algorithm) is to maintain an approximately stable matching (in terms of number of blocking pairs) at all times. The changes in the preference lists are not reported to the algorithm, but must...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2016
ISSN: 0733-8716
DOI: 10.1109/jsac.2016.2615439